Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
نویسندگان
چکیده
We prove that the bicriteria single-machine scheduling problem of minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Our result settles a long-standing open problem.
منابع مشابه
Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
In this paper we introduce a new scheduling model with learning effects in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job’s scheduled position. We show that the single-machine problems to minimize makespan and total completion time are polynomially solvable. In addition, we show that the problems to minim...
متن کاملSome scheduling problems with deteriorating jobs and learning effects
Although scheduling with deteriorating jobs and learning effect has been widely investigated, scheduling research has seldom considered the two phenomena simultaneously. However, job deterioration and learning co-exist in many realistic scheduling situations. In this paper we introduce a new scheduling model in which both job deterioration and learning exist simultaneously. The actual processin...
متن کاملApproximation schemes for minimizing total (weighted) completion time with release dates on a batch machine
A batch machine is a machine that can process a number of jobs simultaneously as a batch, and the processing time of a batch is equal to the longest processing time of the jobs assigned to it. In this paper we present a polynomial time approximation scheme (PTAS) for scheduling a batch machine to minimize the total completion time with job release dates. Also, we present a fully polynomial time...
متن کاملMinimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
We consider the problem of minimizing total completion time in a two-machine owshop. We present a heuristic with worst-case bound 2=(+), where and denote the minimum and maximum processing time of all operations. Furthermore, we analyze four special cases: equal processing times on the rst machine, equal processing times on the second machine, processing a job on the rst machine takes time no m...
متن کاملScheduling Unit-time Operation Jobs on Identical Parallel Machines and in a Flow Shop: Complexity and Correlation
This paper considers the complexity and the correlation of scheduling unit-time jobs on identical parallel machines and unit-time ow-shop scheduling under precedence constraints. It is shown that, in the case of chain-like precedence constraints, the nonpre-emptive parallel-machines problem and the ow-shop problem to minimize maximum or total completion time can be solved in polynomial time, an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Oper. Res. Lett.
دوره 17 شماره
صفحات -
تاریخ انتشار 1995